On Vaughan's approximation: The first moment
نویسندگان
چکیده
منابع مشابه
Lecture 6 : Frequency Moment Approximation
F2 is particularly interesting and useful to approximate. One reason that we might be interested is in understanding the quality of the output of the COUNT Sketch approximation, where |f̃j − fj| ≤ ε||f−j||2 ≤ ε √ F2. Since F1 is easy to compute exactly, the errors in the COUNT-MIN and MisraGries estimates are easy to compute. The F2 approximation lets us get good estimates of the (smaller) error...
متن کاملThe Second Moment Method, Conditioning and Approximation
The second moment method has been fruitfully combined with conditioning by several authors, for example Robinson and Wormald 7], 8] and Frieze and Janson 2]. We try to give a general exposition of this method, and of its relation to approximations of random variables by simpler variables. We discuss several examples where the method has been used in diierent forms. 1. The second moment method O...
متن کاملOn Estimating the First Frequency Moment of Data Streams
Estimating the first moment of a data stream defined as F1 = ∑ i∈{1,2,...,n}|fi| to within 1 ± ǫ-relative error with high probability is a basic and influential problem in data stream processing. A tight space bound of O(ǫ log(mM)) is known from the work of [9]. However, all known algorithms for this problem require per-update stream processing time of Ω(ǫ), with the only exception being the al...
متن کاملDecomposing Differences in the First Moment
Decomposing Differences in the First Moment We propose a simple methodology for decomposing differences in the first moment into characteristics and coefficients effects. This methodology provides a way to apply the Blinder-Oaxaca decomposition to a non-linear function for both aggregate and detailed decompositions. JEL Classification: C20, J70
متن کاملHigher Moment Approximation of Fork / Join
In this paper we present an approximate analysis of fork/join prim-itives with two parallel servers, limited buuers and non-zero join times where either jobs arrive according to a Poisson process (open system) or the number of jobs is limited according to the CONWIP rule (closed system). The approximation method is based on the concept of ow-equivalent servers and enables the approximate analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2017
ISSN: 0024-6107
DOI: 10.1112/jlms.12017